Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss
نویسندگان
چکیده
An l-link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graphbased codes. A successive coding scheme is proposed for converting an l-link binary CEO problem to the (2l − 1) single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically achievable. Our proposed decoder successively decodes the received data by employing the well-known SumProduct (SP) algorithm and leverages them to reconstruct the source. The sum-rate distortion performance of our proposed coding scheme is compared with the theoretical bounds under the logarithmic loss (log-loss) criterion.
منابع مشابه
Successive Wyner-Ziv Coding Scheme and its Application to the Quadratic Gaussian CEO Problem
We introduce a distributed source coding scheme called successive Wyner-Ziv coding scheme. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding. The notion of successive refinement in the single source coding is generalized to the distributed source coding scenario, which we refer to as distributed successive refinem...
متن کاملSuccessively Structured CEO Problems
Successive encoding strategies are developed for some prototype sensor network problems based on generalized Wyner-Ziv encoding. Their performance is analyzed for quadratic-Gaussian versions of both a new serially structured CEO problem as well as the classical CEO problem.
متن کاملThe rate loss in the Wyner-Ziv problem
The rate-distortion function for source coding with side information at the decoder (the \Wyner-Ziv problem") is given in terms of an auxiliary random variable, which forms a Markov chain with the source and the side information. This Markov chain structure, typical to the solution of multiterminal source coding problems, corresponds to a loss in coding rate with respect to the conditional rate...
متن کاملSuccessive structuring of source coding algorithms for data fusion, buffering, and distribution in networks
Numerous opportunities to improve network performance present themselves when we make communication networks aware of the characteristics of the data content they are handling. In this thesis, we design such content-aware algorithms that span traditional network layers and are successively structured, focusing on problems of data fusion, buffering, and distribution. The successive structuring o...
متن کاملBinary CEO Problem under Log-Loss with BSC Test-Channel Model
In this paper, we propose an efficient coding scheme for the two-link binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. The exact rate-distortion bound for a two-link binary CEO problem under the logarithmic loss has been obtained by Courtade and Weissman. We propose an encoding scheme based on compound LDGM-LDPC codes to achieve the theoretical bounds. In the propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018